Understanding Edge Connectivity in the Internet through Core Decomposition
نویسندگان
چکیده
منابع مشابه
Understanding Edge Connectivity in the Internet through Core Decomposition
Internet is a complex network composed by several networks: the Autonomous Systems, each one designed to transport information efficiently. Routing protocols aim to find paths between nodes whenever it is possible (i.e., the network is not partitioned), or to find paths verifying specific constraints (e.g., a certain QoS is required). As connectivity is a measure related to both of them (partit...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملCoreCast: Efficient Live Streaming in the Core-Edge Separated Internet
The increasing bandwidth offered by home broadband connections makes delivering live streaming and IPTV content increasingly more attractive over the Internet. Solutions range from the least bandwidthefficient unicast point-to-multipoint, through peer-to-peer, to the most efficient multicast delivery mechanisms. But IP multicast does not scale well to the global Internet and today’s practical i...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملThe Energy Intensity of the Internet: Edge and Core Networks
Environmental assessments of digital services seeking to take into account the Internet’s energy footprint typically require models of the energy intensity of the Internet. Existing models have arrived at conflicting results. This has lead to increased uncertainty and reduced comparability of assessment results. We present a bottom-up model for the energy intensity of the Internet that draws fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2011
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2011.560786